Monte Carlo Localization
نویسندگان
چکیده
In this paper we investigate robot localization with the Augmented Monte Carlo Localization (aMCL) algorithm. The goal of the algorithm is to enable a robot to localize itself in an known world. The map of the environment where the robot has to localize itself must be given to the robot beforehand. In our case the map is constructed by another robot. This map is a so called occupancy grid. An occupancy map contains a value for every location which indicates the probability that this location is occupied by a object such as a wall. We investigate the influence on the performance of the aMCL algorithm when using occupancy maps as input for the aMCL algorithm. We compare the performance of the aMCL algorithm with different levels of uncertainty and two ways of dealing with this uncertainty. We found that the performance of the aMCL algorithm is best when we convert the occupancy map to a binary map by applying a threshold. In that case each location above a certain threshold is considered occupied. This simple method provided the best performance.
منابع مشابه
Localization of electron virtual SSD in a Siemens-Primus linear accelerator: Comparison of measurements with Monte Carlo simulation
Introduction: Because of importance of impact of the Source to Surface Distance (SSD) in determining of monitor unit for electron-therapy, it is essential to know the Virtual Source Position (VSP) for electron beam for a linear therapeutic accelerator for each energy and field size. , especially using the Khan method (photo distance squared method) And compare the results with...
متن کاملDesign and Application of Iterative Monte Carlo Localization for Mobile Wireless Sensor Networks Based on MCL
In recent years, wireless sensor network had been more and more widely used in our daily life, and with the proposed of Monte Carlo localization (MCL) algorithm, node localization of the mobile wireless sensor network had been solved effectively. But it needed to have a large number of samples if it used the Monte Carlo localization algorithm to obtain a high positioning accuracy. This paper pr...
متن کامل“Where’s the Boss?”: Monte Carlo Localization for an Autonomous Ground Vehicle using an Aerial Lidar Map
متن کامل
Dual Monte Carlo Localization algorithm for localization using wireless signal strength maps
Gaussian Processes have been previously used to model wireless signals strengths and create locationsignal strength mappings. Such mappings can be used for robot localization by computing the posterior probability distributions of robot’s positions given signal strength measurements. This work proposes the use of a dual Monte Carlo Localization algorithm that uses such posterior distributions a...
متن کاملMonte Carlo Localization with Mixture Proposal Distribution
Monte Carlo localization (MCL) is a Bayesian algorithm for mobile robot localization based on particle filters, which has enjoyed great practical success. This paper points out a limitation of MCL which is counter-intuitive, namely that better sensors can yield worse results. An analysis of this problem leads to the formulation of a new proposal distribution for the Monte Carlo sampling step. E...
متن کاملSensor Resetting Localization for Poorly Modelled Mobile Robots
We present a new localization algorithm called Sensor Resetting Localization which is an extension of Monte Carlo Localization. The algorithm adds sensor based resampling to Monte Carlo Localization when the robot is lost. The new algorithm is robust to modelling errors including unmodelled movements and systematic errors. The algorithm can be used in real time on systems with limited computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007